0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.12 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM 0.10/0.33 % Computer : n003.cluster.edu 0.10/0.33 % Model : x86_64 x86_64 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.33 % Memory : 8042.1875MB 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.33 % CPULimit : 1920 0.10/0.33 % WCLimit : 240 0.10/0.33 % DateTime : Wed Jul 30 03:06:04 EDT 2025 0.10/0.33 % CPUTime : 0.17/0.45 Running higher-order theorem proving 0.17/0.46 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.QNleemCibQ/E---3.1_31309.p 0.17/0.47 # Version: 3.0.0-ho 0.17/0.47 # Preprocessing class: HSSSSMSSMLSNHSN. 0.17/0.47 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.17/0.47 # Starting new_ho_9 with 1200s (5) cores 0.17/0.47 # Starting post_as_ho1 with 240s (1) cores 0.17/0.47 # Starting sh1l with 240s (1) cores 0.17/0.47 # Starting post_as_ho10 with 240s (1) cores 0.17/0.47 # new_ho_9 with pid 31387 completed with status 0 0.17/0.47 # Result found by new_ho_9 0.17/0.47 # Preprocessing class: HSSSSMSSMLSNHSN. 0.17/0.47 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.17/0.47 # Starting new_ho_9 with 1200s (5) cores 0.17/0.47 # No SInE strategy applied 0.17/0.47 # Search class: HHUNF-FFSF11-SHSSMMBN 0.17/0.47 # partial match(1): HGUNF-FFSF11-SHSSMMBN 0.17/0.47 # Scheduled 6 strats onto 5 cores with 1200 seconds (1200 total) 0.17/0.47 # Starting ehoh_best2_full_lfho with 649s (1) cores 0.17/0.47 # Starting new_ho_9 with 121s (1) cores 0.17/0.47 # Starting new_bool_2 with 109s (1) cores 0.17/0.47 # Starting ehoh_best8_lambda with 109s (1) cores 0.17/0.47 # Starting sh1l with 109s (1) cores 0.17/0.47 # new_ho_9 with pid 31392 completed with status 10 0.17/0.47 # Starting new_bool_3 with 103s (1) cores 0.17/0.47 # sh1l with pid 31395 completed with status 0 0.17/0.47 # Result found by sh1l 0.17/0.47 # Preprocessing class: HSSSSMSSMLSNHSN. 0.17/0.47 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.17/0.47 # Starting new_ho_9 with 1200s (5) cores 0.17/0.47 # No SInE strategy applied 0.17/0.47 # Search class: HHUNF-FFSF11-SHSSMMBN 0.17/0.47 # partial match(1): HGUNF-FFSF11-SHSSMMBN 0.17/0.47 # Scheduled 6 strats onto 5 cores with 1200 seconds (1200 total) 0.17/0.47 # Starting ehoh_best2_full_lfho with 649s (1) cores 0.17/0.47 # Starting new_ho_9 with 121s (1) cores 0.17/0.47 # Starting new_bool_2 with 109s (1) cores 0.17/0.47 # Starting ehoh_best8_lambda with 109s (1) cores 0.17/0.47 # Starting sh1l with 109s (1) cores 0.17/0.47 # Preprocessing time : 0.001 s 0.17/0.47 0.17/0.47 # Proof found! 0.17/0.47 # SZS status Theorem 0.17/0.47 # SZS output start CNFRefutation 0.17/0.47 thf(decl_29, type, mnot: ($i > $o) > $i > $o). 0.17/0.47 thf(decl_30, type, mor: ($i > $o) > ($i > $o) > $i > $o). 0.17/0.47 thf(decl_32, type, mimpl: ($i > $o) > ($i > $o) > $i > $o). 0.17/0.47 thf(decl_34, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o). 0.17/0.47 thf(decl_38, type, mvalid: ($i > $o) > $o). 0.17/0.47 thf(decl_42, type, epred1_1: ($i > $i > $o) > $i > $o). 0.17/0.47 thf(decl_43, type, esk1_1: ($i > $i > $o) > $i). 0.17/0.47 thf(mimpl, axiom, ((mimpl)=(^[X7:$i > $o, X8:$i > $o]:(mor @ (mnot @ X7) @ X8))), file('/export/starexec/sandbox/tmp/tmp.QNleemCibQ/E---3.1_31309.p', mimpl)). 0.17/0.47 thf(mnot, axiom, ((mnot)=(^[X2:$i > $o, X3:$i]:(~((X2 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.QNleemCibQ/E---3.1_31309.p', mnot)). 0.17/0.47 thf(mor, axiom, ((mor)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)|(X5 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.QNleemCibQ/E---3.1_31309.p', mor)). 0.17/0.47 thf(mbox, axiom, ((mbox)=(^[X10:$i > $i > $o, X11:$i > $o, X1:$i]:(![X12:$i]:(((X10 @ X1 @ X12)=>(X11 @ X12)))))), file('/export/starexec/sandbox/tmp/tmp.QNleemCibQ/E---3.1_31309.p', mbox)). 0.17/0.47 thf(mvalid, axiom, ((mvalid)=(^[X11:$i > $o]:(![X15:$i]:((X11 @ X15))))), file('/export/starexec/sandbox/tmp/tmp.QNleemCibQ/E---3.1_31309.p', mvalid)). 0.17/0.47 thf(thm, conjecture, ?[X10:$i > $i > $o]:(![X19:$i > $o]:((mvalid @ (mimpl @ (mbox @ X10 @ X19) @ X19)))), file('/export/starexec/sandbox/tmp/tmp.QNleemCibQ/E---3.1_31309.p', thm)). 0.17/0.47 thf(c_0_6, plain, ((mimpl)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimpl])). 0.17/0.47 thf(c_0_7, plain, ((mnot)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])). 0.17/0.47 thf(c_0_8, plain, ((mor)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])). 0.17/0.47 thf(c_0_9, plain, ((mimpl)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6, c_0_7]), c_0_8])). 0.17/0.47 thf(c_0_10, plain, ((mbox)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $o, Z2:$i]:(![X12:$i]:(((Z0 @ Z2 @ X12)=>(Z1 @ X12)))))), inference(fof_simplification,[status(thm)],[mbox])). 0.17/0.47 thf(c_0_11, plain, ((mvalid)=(^[Z0/* 6 */:$i > $o]:(![X15:$i]:((Z0 @ X15))))), inference(fof_simplification,[status(thm)],[mvalid])). 0.17/0.47 thf(c_0_12, negated_conjecture, ~(?[X10:$i > $i > $o]:(![X19:$i > $o, X23:$i]:((~(![X22:$i]:(((X10 @ X23 @ X22)=>(X19 @ X22))))|(X19 @ X23))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]), c_0_9]), c_0_10]), c_0_11])). 0.17/0.47 thf(c_0_13, negated_conjecture, ![X24:$i > $i > $o, X27:$i]:(((~(X24 @ (esk1_1 @ X24) @ X27)|(epred1_1 @ X24 @ X27))&~(epred1_1 @ X24 @ (esk1_1 @ X24)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])])). 0.17/0.47 thf(c_0_14, negated_conjecture, ![X10:$i > $i > $o, X1:$i]:(((epred1_1 @ X10 @ X1)|~((X10 @ (esk1_1 @ X10) @ X1)))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.17/0.47 thf(c_0_15, negated_conjecture, ![X10:$i > $i > $o]:(~((epred1_1 @ X10 @ (esk1_1 @ X10)))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.17/0.47 thf(c_0_16, negated_conjecture, ![X1:$i]:((epred1_1 @ (^[Z0/* 19 */:$i, Z1:$i]:(($true))) @ X1)), inference(primitive_enumeration,[status(thm)],[c_0_14])). 0.17/0.47 thf(c_0_17, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_15, c_0_16]), ['proof']). 0.17/0.47 # SZS output end CNFRefutation 0.17/0.47 # Parsed axioms : 36 0.17/0.47 # Removed by relevancy pruning/SinE : 0 0.17/0.47 # Initial clauses : 22 0.17/0.47 # Removed in clause preprocessing : 20 0.17/0.47 # Initial clauses in saturation : 2 0.17/0.47 # Processed clauses : 3 0.17/0.47 # ...of these trivial : 0 0.17/0.47 # ...subsumed : 0 0.17/0.47 # ...remaining for further processing : 3 0.17/0.47 # Other redundant clauses eliminated : 0 0.17/0.47 # Clauses deleted for lack of memory : 0 0.17/0.47 # Backward-subsumed : 0 0.17/0.47 # Backward-rewritten : 0 0.17/0.47 # Generated clauses : 4 0.17/0.47 # ...of the previous two non-redundant : 2 0.17/0.47 # ...aggressively subsumed : 0 0.17/0.47 # Contextual simplify-reflections : 0 0.17/0.47 # Paramodulations : 1 0.17/0.47 # Factorizations : 0 0.17/0.47 # NegExts : 0 0.17/0.47 # Equation resolutions : 0 0.17/0.47 # Disequality decompositions : 0 0.17/0.47 # Total rewrite steps : 0 0.17/0.47 # ...of those cached : 0 0.17/0.47 # Propositional unsat checks : 0 0.17/0.47 # Propositional check models : 0 0.17/0.47 # Propositional check unsatisfiable : 0 0.17/0.47 # Propositional clauses : 0 0.17/0.47 # Propositional clauses after purity: 0 0.17/0.47 # Propositional unsat core size : 0 0.17/0.47 # Propositional preprocessing time : 0.000 0.17/0.47 # Propositional encoding time : 0.000 0.17/0.47 # Propositional solver time : 0.000 0.17/0.47 # Success case prop preproc time : 0.000 0.17/0.47 # Success case prop encoding time : 0.000 0.17/0.47 # Success case prop solver time : 0.000 0.17/0.47 # Current number of processed clauses : 3 0.17/0.47 # Positive orientable unit clauses : 1 0.17/0.47 # Positive unorientable unit clauses: 0 0.17/0.47 # Negative unit clauses : 1 0.17/0.47 # Non-unit-clauses : 1 0.17/0.47 # Current number of unprocessed clauses: 1 0.17/0.47 # ...number of literals in the above : 2 0.17/0.47 # Current number of archived formulas : 0 0.17/0.47 # Current number of archived clauses : 0 0.17/0.47 # Clause-clause subsumption calls (NU) : 0 0.17/0.47 # Rec. Clause-clause subsumption calls : 0 0.17/0.47 # Non-unit clause-clause subsumptions : 0 0.17/0.47 # Unit Clause-clause subsumption calls : 0 0.17/0.47 # Rewrite failures with RHS unbound : 0 0.17/0.47 # BW rewrite match attempts : 0 0.17/0.47 # BW rewrite match successes : 0 0.17/0.47 # Condensation attempts : 0 0.17/0.47 # Condensation successes : 0 0.17/0.47 # Termbank termtop insertions : 991 0.17/0.47 # Search garbage collected termcells : 155 0.17/0.47 0.17/0.47 # ------------------------------------------------- 0.17/0.47 # User time : 0.002 s 0.17/0.47 # System time : 0.003 s 0.17/0.47 # Total time : 0.005 s 0.17/0.47 # Maximum resident set size: 1900 pages 0.17/0.47 0.17/0.47 # ------------------------------------------------- 0.17/0.47 # User time : 0.006 s 0.17/0.47 # System time : 0.009 s 0.17/0.47 # Total time : 0.014 s 0.17/0.47 # Maximum resident set size: 1760 pages 0.17/0.47 % E exiting 0.17/0.47 % E exiting 0.17/0.47 EOF